Matching and Independence Complexes Related to Small Grids

نویسندگان

  • Benjamin Braun
  • Wesley K. Hough
چکیده

The topology of the matching complex for the 2×n grid graph is mysterious. We describe a discrete Morse matching for a family of independence complexes Ind(∆n ) that include these matching complexes. Using this matching, we determine the dimensions of the chain spaces for the resulting Morse complexes and derive bounds on the location of non-trivial homology groups for certain Ind(∆n ). Furthermore, we determine the Euler characteristic of Ind(∆n ) and prove that several homology groups of Ind(∆n ) are non-zero.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

un 2 01 6 MATCHING AND INDEPENDENCE COMPLEXES RELATED TO SMALL GRIDS

The topology of the matching complex for the 2 × n grid graph is mysterious. We describe a discrete Morse matching for a family of independence complexes Ind(∆mn ) that include these matching complexes. Using this matching, we determine the dimensions of the chain spaces for the resulting Morse complexes and derive bounds on the location of non-trivial homology groups for certain Ind(∆mn ). Fur...

متن کامل

Vertex Decomposable Simplicial Complexes Associated to Path Graphs

Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...

متن کامل

Matching Integral Graphs of Small Order

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

متن کامل

A Comparative study of sport spaces in selected universities of the world

Nowadays, sport complexes are one of the most important parts of the universities that play a key role in improving the quality of studentschr('39') life and enhancing their desirable living standards, so that It is important to pay attention to the concept of forming these spaces throughout history and to suggest ways of promoting their position in universities and clarify their criteria and s...

متن کامل

New methods for constructing shellable simplicial complexes

A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2017